Stability of rounded off inverses under iteration
نویسندگان
چکیده
منابع مشابه
Stability of Rounded Off Inverses Under Iteration
Let / be a monotone and strictly convex (or concave) function on a real interval and let g be the inverse function. Let I(x) = x. For a real valued function and N a positive integer let (t>pf(x) denote the rounding of (x) to N significant figures. Let h = gff » fa, the composition of f^ and g^¡. It is shown that h » ft » Iff = h o h » h « Ifj, and that equality can fail for fewer iterati...
متن کاملComputing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration
We modify the algorithm of [1], based on Newton’s iteration and on the concept of 2-displacement rank, to the computation of the Moore-Penrose inverse of a rank-deficient Toeplitz matrix. Numerical results are presented to illustrate the effectiveness of the method.
متن کاملOn Newton-Raphson iteration for multiplicative inverses modulo prime powers
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over p-adic numbers gives a recurrence relation computing modular inverse modulo p, that is logarithmic in m. We solve the recurrence to obtain an explicit formula for the inverse. Then we study different implementation variants of this iteration and show that our explicit formula is interesting for small...
متن کاملCircularly Polarized Rounded-Off Triangular Microstrip Line Array Antenna
The Japan Aerospace Exploration Agency (JAXA) plans to launch a geostationary satellite called Engineering Test Satellite VIII (ETS-VIII) in FY 2006. In this paper, a microstrip line array antenna, which has a very simple structure, is introduced to radiate a circularly polarized wave aiming at ETS-VIII applications. This antenna consists of a triangular conducting line with its vertexes rounde...
متن کاملPreservation of Properness under Countable Support Iteration
If ≤ is a preorder on a set P and p0 ≤ p1, we say that p1 is an extension of p0. Recall that a preorder is separative if and only if whenever p1 is not an extension of p0 there is an extension of p1 which is incompatible with p0. We say that P = (P,≤) is a forcing notion (also forcing poset) if ≤ is a separative preorder with minimal element 0P. Note that if P is separative and p1 p̌0 ∈ Ġ then p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1978
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1978-0461879-7